Scoring Algorithms For Wordspotting Systems

نویسندگان

  • Robert W. Morris
  • Jon A. Arrowood
  • Peter S. Cardillo
  • Mark A. Clements
چکیده

When evaluating wordspotting systems, one normally compares receiver operating characteristic curves and different measures of accuracy. However, there are many other factors that are relevant to the system’s usability for searching speech. In this paper, we discuss both measures of quality for confidence scores and propose algorithms for producing scores that are optimal with respect to these criteria.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wordspotting using a predictive neural model for the telephone speech corpus

We describe a wordspotting algorithm based on a predictive neural model for a telephone speech corpus. Each keyword is modeled as a whole word. For keyword detection scoring we used a minimum accumulated prediction residual. We computed empirically a threshold value for rejecting non-keyword speech in place of building non-keyword models. We tested the algorithm with the TUBTEL telephone speech...

متن کامل

Personal Credit Score Prediction using Data Mining Algorithms (Case Study: Bank Customers)

Knowledge and information extraction from data is an age-old concept in scientific studies. In industrial decision-making processes, the application of this concept gives rise to data-mining opportunities. Personal credit scoring is an ever-vital tool for banking systems in order to manage and minimize the inherent risks of the financial sector, thus, the design and improvement of credit scorin...

متن کامل

Hmm Based Fast Keyword Spotting Algorithm with No Garbage Modeliis

\ , I \ I I The problem Of discriminating keyword and non-keyword speech which is important in wordspotting applications is addressed here. We have shown that garbage models cannot reduce both rejection and false alarm rates simultaneously. Thus, the following relation becomes apparent from the above inequalities O'In I ) > " ( o ' l l P ) . P(08 I R P ) > p(oP I R 1 ) (4) TO achieve this we ha...

متن کامل

Empirical comparison of two multilayer perceptron-based keyword speech recognition algorithms

In this paper, an empirical comparison of two multilayer perceptron (MLP)-based techniques for keyword speech recognition (wordspotting) is described. The techniques are the predictive neural model (PNM)-based wordspotting, in which the MLP is applied as a speech pattern predictor to compute a local distance between the acoustic vector and the phone model, and the hybrid HMM/MLP-based wordspott...

متن کامل

A fast lattice-based approach to vocabulary independent wordspotting

Practical applications of wordspotting, such as spoken message retrieval and browsing, require the ability to process large amounts of speech data at speeds many times faster than real-time. This paper presents a novel approach to this problem in which all of the stored audio material is prepro-cessed oo-line to generate a phoneme lattice. At search time, putative word matches are found in this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004